Spanning edge betweenness
نویسندگان
چکیده
We present a new edge betweenness metric for undirected and weighted graphs. This metric is defined as the fraction of minimum spanning trees where a given edge is present and it was motivated by the necessity of evaluating phylogenetic trees. Moreover we provide results and methods concerning the exact computation of this metric based on the well known Kirchhoff’s matrix tree theorem.
منابع مشابه
Spanning Edge Betweenness in Practice
In this paper we present a study about spanning edge betweenness, an edge-based metric for complex network analysis that is defined as the probability of an edge being part of a minimum spanning tree. This probability reflects how redundant an edge is in what concerns the connectivity of a given network and, hence, its value gives information about the network topology. We apply this metric to ...
متن کاملScale-free trees: the skeletons of complex networks.
We investigate the properties of the spanning trees of various real-world and model networks. The spanning tree representing the communication kernel of the original network is determined by maximizing the total weight of the edges, whose weights are given by the edge betweenness centralities. We find that a scale-free tree and shortcuts organize a complex network. Especially, in ubiquitous sca...
متن کاملNot Seeing the Forest for the Trees: Size of the Minimum Spanning Trees (MSTs) Forest and Branch Significance in MST-Based Phylogenetic Analysis
Trees, including minimum spanning trees (MSTs), are commonly used in phylogenetic studies. But, for the research community, it may be unclear that the presented tree is just a hypothesis, chosen from among many possible alternatives. In this scenario, it is important to quantify our confidence in both the trees and the branches/edges included in such trees. In this paper, we address this proble...
متن کاملPairwise Co-betweenness for Several Types of Network
Vertex betweenness centrality is essential in the analysis of social and information networks, and it quantify vertex importance in terms of its quantity of information along geodesic paths in network. Edge betweenness is similar to the vertex betweenness. Co-betweenness centrality is a natural developed notion to extend vertex betweenness centrality to sets of vertices, and pairwise co-between...
متن کاملLocal Edge Betweenness based Label Propagation for Community Detection in Complex Networks
Nowadays, identification and detection community structures in complex networks is an important factor in extracting useful information from networks. Label propagation algorithm with near linear-time complexity is one of the most popular methods for detecting community structures, yet its uncertainty and randomness is a defective factor. Merging LPA with other community detection metrics would...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013